Перевод: с английского на все языки

со всех языков на английский

vector distance algorithm

См. также в других словарях:

  • Vector quantization — is a classical quantization technique from signal processing which allows the modeling of probability density functions by the distribution of prototype vectors. It was originally used for data compression. It works by dividing a large set of… …   Wikipedia

  • Distance-vector routing protocol — In computer communication theory relating to packet switched networks, a distance vector routing protocol is one of the two major classes of routing protocols, the other major class being the link state protocol. Distance vector routing protocols …   Wikipedia

  • Distance of closest approach of ellipses and ellipsoids — The distance of closest approach of two objects is the distance between their centers when they are externally tangent. The objects may be geometric shapes or physical particles with well defined boundaries. The distance of closest approach is… …   Wikipedia

  • Vector space — This article is about linear (vector) spaces. For the structure in incidence geometry, see Linear space (geometry). Vector addition and scalar multiplication: a vector v (blue) is added to another vector w (red, upper illustration). Below, w is… …   Wikipedia

  • Distance — This article is about distance in the mathematical or physical sense. For other senses of the term, see distance (disambiguation). Proximity redirects here. For the 2001 film, see Proximity (film). Distance (or farness) is a numerical description …   Wikipedia

  • distance vector algorithm —    A family of routing algorithms that calculate the bestpath route to use for data transmission from information present in adjacent nodes on the network. Routing information is broadcast periodically rather than only when a change occurs, which …   Dictionary of networking

  • Vector slime — In the demoscene (demo (computer programming)), vector slime refers to a class of visual effects achieved by procedural deformation of geometric shapes. Synopsis A geometric object exposed to vector slime is usually defined by vertices and faces… …   Wikipedia

  • Support vector machine — Support vector machines (SVMs) are a set of related supervised learning methods used for classification and regression. Viewing input data as two sets of vectors in an n dimensional space, an SVM will construct a separating hyperplane in that… …   Wikipedia

  • K-nearest neighbor algorithm — In pattern recognition, the k nearest neighbor algorithm ( k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance based learning, or lazy learning where the function is only… …   Wikipedia

  • Constraint algorithm — In mechanics, a constraint algorithm is a method for satisfying constraints for bodies that obey Newton s equations of motion. There are three basic approaches to satisfying such constraints: choosing novel unconstrained coordinates ( internal… …   Wikipedia

  • Ad-hoc On-demand Distance Vector — AODV (pour Ad hoc On Demand Distance Vector) est un protocole de routage destiné aux réseaux mobiles (en mode ad hoc). Il est à la fois capable de routage Unicast et Multicast. Il est libre de boucle, auto démarrant et s accommode d un grand… …   Wikipédia en Français

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»